Network Creation Games: Think Global - Act Local

We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC'03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bil\`o et al., SPAA'14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy-changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the price of anarchy.Comment: An extended abstract of this paper has been accepted for publication in the proceedings of the 40th International Conference on Mathematical Foundations on Computer Scienc

Strategic Network Formation with Attack and Immunization

Strategic network formation arises where agents receive benefit from connections to other agents, but also incur costs for forming links. We consider a new network formation game that incorporates an adversarial attack, as well as immunization against attack. An agent's benefit is the expected size of her connected component post-attack, and agents may also choose to immunize themselves from attack at some additional cost. Our framework is a stylized model of settings where reachability rather than centrality is the primary concern and vertices vulnerable to attacks may reduce risk via costly measures. In the reachability benefit model without attack or immunization, the set of equilibria is the empty graph and any tree. The introduction of attack and immunization changes the game dramatically; new equilibrium topologies emerge, some more sparse and some more dense than trees. We show that, under a mild assumption on the adversary, every equilibrium network with $n$ agents contains at most $2n-4$ edges for $n\geq 4$. So despite permitting topologies denser than trees, the amount of overbuilding is limited. We also show that attack and immunization don't significantly erode social welfare: every non-trivial equilibrium with respect to several adversaries has welfare at least as that of any equilibrium in the attack-free model. We complement our theory with simulations demonstrating fast convergence of a new bounded rationality dynamic which generalizes linkstable best response but is considerably more powerful in our game. The simulations further elucidate the wide variety of asymmetric equilibria and demonstrate topological consequences of the dynamics e.g. heavy-tailed degree distributions. Finally, we report on a behavioral experiment on our game with over 100 participants, where despite the complexity of the game, the resulting network was surprisingly close to equilibrium.Comment: The short version of this paper appears in the proceedings of WINE-1

On the Structure of Equilibria in Basic Network Formation

We study network connection games where the nodes of a network perform edge swaps in order to improve their communication costs. For the model proposed by Alon et al. (2010), in which the selfish cost of a node is the sum of all shortest path distances to the other nodes, we use the probabilistic method to provide a new, structural characterization of equilibrium graphs. We show how to use this characterization in order to prove upper bounds on the diameter of equilibrium graphs in terms of the size of the largest $k$-vicinity (defined as the the set of vertices within distance $k$ from a vertex), for any $k \geq 1$ and in terms of the number of edges, thus settling positively a conjecture of Alon et al. in the cases of graphs of large $k$-vicinity size (including graphs of large maximum degree) and of graphs which are dense enough. Next, we present a new swap-based network creation game, in which selfish costs depend on the immediate neighborhood of each node; in particular, the profit of a node is defined as the sum of the degrees of its neighbors. We prove that, in contrast to the previous model, this network creation game admits an exact potential, and also that any equilibrium graph contains an induced star. The existence of the potential function is exploited in order to show that an equilibrium can be reached in expected polynomial time even in the case where nodes can only acquire limited knowledge concerning non-neighboring nodes.Comment: 11 pages, 4 figure

Selfish Network Creation with Non-Uniform Edge Cost

Network creation games investigate complex networks from a game-theoretic point of view. Based on the original model by Fabrikant et al. [PODC'03] many variants have been introduced. However, almost all versions have the drawback that edges are treated uniformly, i.e. every edge has the same cost and that this common parameter heavily influences the outcomes and the analysis of these games. We propose and analyze simple and natural parameter-free network creation games with non-uniform edge cost. Our models are inspired by social networks where the cost of forming a link is proportional to the popularity of the targeted node. Besides results on the complexity of computing a best response and on various properties of the sequential versions, we show that the most general version of our model has constant Price of Anarchy. To the best of our knowledge, this is the first proof of a constant Price of Anarchy for any network creation game.Comment: To appear at SAGT'1

Competing exciton localization effects due to disorder and shallow defects in semiconductor alloys

We demonstrate that excitons in semiconductor alloys are subject to competing localization effects due to disorder (random potential fluctuations) and shallow point defects (impurities). The relative importance of these effects varies with alloy chemical composition, impurity activation energy as well as temperature. We evaluate this effect quantitatively for MgxZn1−xO : Al (0 6 x 6 0.058) and find that exciton localization at low (2 K) and high (300 K) temperatures is dominated by shallow donor impurities and alloy disorder, respectively

Greedy Selfish Network Creation

We introduce and analyze greedy equilibria (GE) for the well-known model of selfish network creation by Fabrikant et al.[PODC'03]. GE are interesting for two reasons: (1) they model outcomes found by agents which prefer smooth adaptations over radical strategy-changes, (2) GE are outcomes found by agents which do not have enough computational resources to play optimally. In the model of Fabrikant et al. agents correspond to Internet Service Providers which buy network links to improve their quality of network usage. It is known that computing a best response in this model is NP-hard. Hence, poly-time agents are likely not to play optimally. But how good are networks created by such agents? We answer this question for very simple agents. Quite surprisingly, naive greedy play suffices to create remarkably stable networks. Specifically, we show that in the SUM version, where agents attempt to minimize their average distance to all other agents, GE capture Nash equilibria (NE) on trees and that any GE is in 3-approximate NE on general networks. For the latter we also provide a lower bound of 3/2 on the approximation ratio. For the MAX version, where agents attempt to minimize their maximum distance, we show that any GE-star is in 2-approximate NE and any GE-tree having larger diameter is in 6/5-approximate NE. Both bounds are tight. We contrast these positive results by providing a linear lower bound on the approximation ratio for the MAX version on general networks in GE. This result implies a locality gap of $\Omega(n)$ for the metric min-max facility location problem, where n is the number of clients.Comment: 28 pages, 8 figures. An extended abstract of this work was accepted at WINE'1

Theory for the ultrafast ablation of graphite films

The physical mechanisms for damage formation in graphite films induced by femtosecond laser pulses are analyzed using a microscopic electronic theory. We describe the nonequilibrium dynamics of electrons and lattice by performing molecular dynamics simulations on time-dependent potential energy surfaces. We show that graphite has the unique property of exhibiting two distinct laser induced structural instabilities. For high absorbed energies (> 3.3 eV/atom) we find nonequilibrium melting followed by fast evaporation. For low intensities above the damage threshold (> 2.0 eV/atom) ablation occurs via removal of intact graphite sheets.Comment: 5 pages RevTeX, 3 PostScript figures, submitted to Phys. Re

High-harmonic generation from a confined atom

The order of high harmonics emitted by an atom in an intense laser field is limited by the so-called cutoff frequency. Solving the time-dependent Schr\"odinger equation, we show that this frequency can be increased considerably by a parabolic confining potential, if the confinement parameters are suitably chosen. Furthermore, due to confinement, the radiation intensity remains high throughout the extended emission range. All features observed can be explained with classical arguments.Comment: 4 pages(tex files), 4 figures(eps files); added references and comment

Relativistic treatment of harmonics from impurity systems in quantum wires

Within a one particle approximation of the Dirac equation we investigate a defect system in a quantum wire. We demonstrate that by minimally coupling a laser field of frequency omega to such an impurity system, one may generate harmonics of multiples of the driving frequency. In a multiple defect system one may employ the distance between the defects in order to tune the cut-off frequency.Comment: 9 pages Latex, 8 eps figures, section added, numerics improve

Drivers of the relative richness of naturalized and invasive plant species on Earth

Biological invasions are a defining feature of the Anthropocene, but the factors that determine the spatially uneven distribution of alien plant species are still poorly understood. Here, we present the first global analysis of the effects of biogeographic factors, the physical environment and socio-economy on the richness of naturalized and invasive alien plants. We used generalized linear mixed-effects models and variation partitioning to disentangle the relative importance of individual factors, and, more broadly, of biogeography, physical environment and socio-economy. As measures of the magnitude of permanent anthropogenic additions to the regional species pool and of species with negative environmental impacts, we calculated the relative richness of naturalized (= RRN) and invasive (= RRI) alien plant species numbers adjusted for the number of native species in 838 terrestrial regions. Socio-economic factors (per-capita gross domestic product (GDP), population density, proportion of agricultural land) were more important in explaining RRI (~50 % of the explained variation) than RRN (~40 %). Warm-temperate and (sub)tropical regions have higher RRN than tropical or cooler regions. We found that socio-economic pressures are more relevant for invasive than for naturalized species richness. The expectation that the southern hemisphere is more invaded than the northern hemisphere was confirmed only for RRN on islands, but not for mainland regions nor for RRI. On average, islands have ~6-fold RRN, and >3-fold RRI compared to mainland regions. Eighty-two islands (=26 % of all islands) harbour more naturalized alien than native plants. Our findings challenge the widely held expectation that socio-economic pressures are more relevant for plant naturalization than for invasive plants. To meet international biodiversity targets and halt the detrimental consequences of plant invasions, it is essential to disrupt the connection between socio-economic development and plant invasions by improving pathway management, early detection and rapid response